Fast trie-based method for multiple pairwise sequence alignment
نویسندگان
چکیده
منابع مشابه
A Fast Method for Linear Space Pairwise Sequence Alignment
Pairwise sequence alignment is an important technique for finding the optimal arrangement between two sequences. A basic dynamic-programming strategy for sequence alignment needs O(mn) time and also O(mn) space. Hirschberg’s divide-and-conquer method reduces the required space to roughly 2m (m ≤ n), but it also doubles the computing time. On the other hand, the FastLSA approach adds extra rows ...
متن کاملA Fast Template Based Heuristic For Global Multiple Sequence Alignment
Advances in bio-technology have made available massive amounts of functional, structural and genomic data for many biological sequences. This increased availability of heterogeneous biological data has resulted in biological applications where a multiple sequence alignment (msa) is required for aligning similar features, where a feature is described in structural, functional or evolutionary ter...
متن کاملFast A Algorithms for Multiple Sequence Alignment
The multiple alignment of the sequences of DNA and proteins is applicable to various important elds in molecular biology. Although the approach based on Dynamic Programming is well-known for this problem, it requires enormous time and space to obtain the optimal alignment. On the other hand, this problem corresponds to the shortest path problem and the A algorithm, which can e ciently nd the sh...
متن کاملPairwise Sequence Alignment
Instructions for obtaining the Solution Sheet are available by sending email to [email protected], with no subject line, and the following message body: subscribe vsns-bcd-solutions VSNS{BCD Copyright. The text may be redistributed verbatim, in whole or in part, for research and educational purposes only. If distributed in part, it must include this copyright notice, and a pointer ...
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Доклады Академии наук
سال: 2019
ISSN: 0869-5652
DOI: 10.31857/s0869-56524844401-404